Cache-related preemption delay analysis for FIFO caches
نویسندگان
چکیده
منابع مشابه
A Cache Related Preemption Delay Analysis for Multi-level Non-inclusive Caches
domain. Assume thatM represents the set of all memory blocks and Dc captures the set of inclusion patterns of a memory block in a two-level cache hierarchy. The domain of the analysis (D) is the set of all valid mappings fromM to Dc as follows. D : M → (Dc ∪ {⊤}) (1) ACM Transactions on Embedded Computing Systems, Vol. V, No. N, Article A, Publication date: January YYYY. A:10 S. Chattopadhyay a...
متن کاملBounding Cache-Related Preemption Delay for Real-Time Systems
ÐCache memory is used in almost all computer systems today to bridge the ever increasing speed gap between the processor and main memory. However, its use in multitasking computer systems introduces additional preemption delay due to the reloading of memory blocks that are replaced during preemption. This cache-related preemption delay poses a serious problem in real-time computing systems wher...
متن کاملTightening the Bounds on Cache-Related Preemption Delay in Fixed Preemption Point Scheduling
Limited Preemptive Fixed Preemption Point scheduling (LP-FPP) has the ability to decrease and control the preemption-related overheads in the real-time task systems, compared to other limited or fully preemptive scheduling approaches. However, existing methods for computing the preemption overheads in LP-FPP systems rely on over-approximation of the evicting cache blocks (ECB) calculations, pot...
متن کاملAnalysis of cache-related preemption delay in fixed-priority preemptive scheduling
We propose a technique for analyzing cache-related preemption delays of tasks that cause unpredictable variation in task execution time in the context of fixed-priority preemptive scheduling. The proposed technique consists of two steps. The first step performs a per-task analysis to estimate cache-related preemption cost for each execution point in a given task from the number of useful cache ...
متن کاملIntegration of Cache Related Preemption Delay Analysis in Priority Assignment Algorithm
Handling cache related preemption delay (CRPD) in a preemptive scheduling context for real-time systems stays an open subject despite of its practical importance. Priority assignment algorithms and feasibility tests are usually based on the assumption that preemption cost is negligible. Then, a system that could be schedulable at design time can fail to meet its timing constraints in practice d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 2014
ISSN: 0362-1340,1558-1160
DOI: 10.1145/2666357.2597814